Modularity for heterogeneous networks.

Evaluating Community Structure in Bipartite Networks.

Detecting communities from tripartite networks.

A New Modularity for Detecting One%2Dto%2DMany Correspondence of Communities in Bipartite Networks.

Detecting Communities in Tripartite Hypergraphs

Detecting Communities from Bipartite Networks Based on Bipartite Modularities.

Community Division of Heterogeneous Networks.

Community Division of Heterogeneous Networks.

Modularities for bipartite networks.

Modularities for bipartite networks.

Community Detection in Large%2DScale Bipartite Networks.

How Does Label Propagation Algorithm Work in Bipartite Networks%3F

Analysis of Online Question%2DAnswering Forums as Heterogeneous Networks.

Identification of MCMC Samples for Clustering.
Abstract. For clustering problems, many studies use just MAP assignments to show clustering results instead of using whole samples from a MCMC sampler. This is because it is not straightforward to recognize clusters based on whole samples. Thus, we proposed an identification algorithm which constructs groups of relevant clusters. The identification exploits spectral clustering to group clusters. Although a naive spectral clustering algorithm is intractable due to memory space and computational time, we developed a memory-and-time efficient spectral clustering for samples of a MCMC sampler. In experiments, we show our algorithm is tractable for real data while the naive algorithm is intractable. For search query log data, we also show representative vocabularies of clusters, which cannot be chosen by just MAP assignments. 1
Discovering%2C Visualizing and Evaluating Online Bipartite Communities.

Link Prediction based on Structural Properties of Online Social Networks.

Link Prediction of Social Networks Based on Weighted Proximity Measures.

Discovering and Visualizing Network Communities.

Extracting Users%27 Interests of Web%2Dwatching Behaviors Based on Site%2DKeyword Graph.

Discovery of User Communities Based on Terms of Web Log Data.

Special Issue on Intelligent Web Interaction.

Detection of Breaking News from Online Web Search Queries.

Towards the Detection of Breaking News from Online Web Search Keywords.

Extracting Keywords of Web Users%27 Interests and Visualizing their Routine Visits.

Extracting Users%27 Interests from Web Log Data.

Extraction of Structural Information from the Web.
In this paper, we propose a new approach to discover informative contents from a set of tabular documents (or Web pages) of a Web site. Our system, InfoDiscoverer, first partitions a page into several content blocks according to HTML tag &lt;TABLE&gt; in a Web page. Based on the occurrence of the features (terms) in the set of pages, it calculates entropy value of each feature. According to the entropy value of each feature in a content block, the entropy value of the block is defined. By analyzing the information measure, we propose a method to dynamically select the entropy-threshold that partitions blocks into either informative or redundant. Informative content blocks are distinguished parts of the page, whereas redundant content blocks are common parts. Based on the answer set generated from 13 manually tagged news Web sites with a total of 26,518 Web pages, experiments show that both recall and precision rates are greater than 0.956. That is, using the approach, informative blocks (news articles) of these sites can be automatically separated from semantically redundant contents such as advertisements, banners, navigation panels, news categories, etc. By adopting InfoDiscoverer as the preprocessor of information retrieval and extraction applications, the retrieval and extracting precision will be increased, and the indexing size and extracting complexity will also be reduced.
Roles of Diagrammatic Information for the Discovery of Geometrical Theorems.

Discovery of User Communities from Web Audience Measurement Data.

Discovery of User Communities from Web Audience Measurement Data.



DIPS Diagrammatic arithmetic problem solver.

A Method for Discovering Purified Web Communities.

Finding Related Web Pages Based on Connectivity Information from a Search Engine.
This paper proposes a method for finding related Web pages based on connectivity information of hyperlinks. As claimed by Kumar, a complete bipartite graph of Web pages can be regarded as a Web community sharing a common interest. However, preparing Web snapshot data for the search of such communities is not an easy task since the Web is huge and is growing. In our method, connectivity information is acquired from a search engine by backlink search. A system based on the method succeeds in finding several genres of Web communities only from a few input URLs without analyzing the contents of Web pages.
A problem solver for quadratic functions.

A method of inductive machine discovery based on experimental data acquisition.

A method of inductive machine discovery based on experimental data acquisition.

Discovery of Web Communities Based on the Co%2DOccurence of References.

Machine Discovery Based on the Co%2Doccurrence of References in a Search Engine.

A method of machine discovery based on geometrical structure.

Machine Discovery Based on Numerical Data Generated in Computer Experiments.

A Discovery System for Trigonometric Functions.

